Backbones in Optimization and Approximation
نویسندگان
چکیده
We study the impact of backbones in optimization and approximation problems. We show that some optimization problems like graph coloring resemble decision problems, with problem hardness positively correlated with backbone size. For other optimization problems like blocks world planning and traveling salesperson problems, problem hardness is weakly and negatively correlated with backbone size, while the cost of finding optimal and approximate solutions is positively correlated with backbone size. A third class of optimization problems like number partitioning have regions of both types of behavior. We find that to observe the impact of backbone size on problem hardness, it is necessary to eliminate some symmetries, perform trivial reductions and factor out the effective problem size.
منابع مشابه
Continuous Discrete Variable Optimization of Structures Using Approximation Methods
Optimum design of structures is achieved while the design variables are continuous and discrete. To reduce the computational work involved in the optimization process, all the functions that are expensive to evaluate, are approximated. To approximate these functions, a semi quadratic function is employed. Only the diagonal terms of the Hessian matrix are used and these elements are estimated fr...
متن کاملBackbone Strategy For Unconstrained Continuous Optimization
Backbones in optimization problems are structures within the decision variables that are common to all global optima. Identifying those backbones in a deterministic manner is at least as hard as solving the original problem to optimality because all optimal solutions to the problem have to be known. A number of different algorithms have been proposed which use heuristically determined backbones...
متن کاملA Two Level Approximation Technique for Structural Optimization
This work presents a method for optimum design of structures, where the design variables can he considered as Continuous or discrete. The variables are chosen as sizing variables as well as coordinates of joints. The main idea is to reduce the number of structural analyses and the overal cost of optimization. In each design cycle, first the structural response quantities such as forces, displac...
متن کاملSearching for Backbones – An Efficient Parallel Algorithm for Finding Groundstates in Spin Glass Models
Comparing different good solutions for an optimization problem, one usually finds structures which are common to all solutions. Thus, one can assume that these “backbones” are part of any good solution and also of the global optimum of the considered problem. For spin glass models like the Sherrington-Kirkpatrick-model, these backbones consist of spins which are parallel and antiparallel, rsp.,...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کامل